On Linear Time Minor Tests and Depth First Search
نویسنده
چکیده
منابع مشابه
Linear-Time In-Place DFS and BFS in the Restore Model
We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs in the restore model in linear time. To obtain our results we show several linear-time in-place graph transformations from one representation to another representation.
متن کاملDepth-First vs. Best-First Search: New Results
Best-first search (BFS) expands the fewest nodes among all admissible algorithms using the same cost function, but typically requires exponential space. Depth-first search needs space only linear in the maximumsearch depth, but expands more nodes than BFS. Using a random tree, we analytically show that the expected number of nodes expanded by depth-first branch-and-bound (DFBnB) is no more than...
متن کاملCorrigenda: Corrections to a Distributed Depth-First Search Algorithm
An earlier paper [l] presents an efficient distributed depth-first search algorithm, with a time complexity 2 1 V 1 and a message complexity 2 1 V I. The algorithm is derived from the traditional sequential depth-first search algorithm. We point out a few errors in the above paper [l] and the corresponding corrections. These errors are mostly minor coding errors; the overall algorithm indicated...
متن کاملAn Efficient Method for Constructing a Distributed Depth-First Search Tree
We present an efficient distributed depth-first search algorithm. The algorithm in the worst case requires (1 + r)(|V | − 1) messages and (1 + r)(|V | − 1) units of time, where 0 ≤ r < 1 and |V | is the number of sites in the network. The value of r depends on the search path and the graph topology. In the best case when r = 0, the algorithm requires only |V | − 1 messages and time units. This ...
متن کاملFinding optimal satisficing strategies for and-or trees
Many tasks require evaluating a specified Boolean expression over a set of probabilistic tests whose costs and success probabilities are each known. A strategy specifies when to perform which test, towards determining the overall outcome of . We are interested in finding the strategy with the minimum expected cost. As this task is typically NP-hard — for example, when tests can occur many times...
متن کامل